Generalized Euclidean distance matrices

نویسندگان

چکیده

Euclidean distance matrices (EDM) are symmetric nonnegative with several interesting properties. In this article, we introduce a wider class of called generalized (GEDMs) that include EDMs. Each GEDM is an entry-wise matrix. A not unless it EDM. By some new techniques, show many significant results on can be extended to matrices. These contain about eigenvalues, inverse, determinant, spectral radius, Moore–Penrose inverse and majorization inequalities. We finally give application by constructing infinitely divisible using

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Euclidean distance matrices

If A is a real symmetric matrix and P is an orthogonal projection onto a hyperplane, then we derive a formula for the Moore-Penrose inverse of PAP . As an application, we obtain a formula for the MoorePenrose inverse of a Euclidean distance matrix (EDM) which generalizes formulae for the inverse of a EDM in the literature. To an invertible spherical EDM, we associate a Laplacian matrix (which w...

متن کامل

Euclidean Distance Matrices and Applications

Over the past decade, Euclidean distance matrices, or EDMs, have been receiving increased attention for two main reasons. The first reason is that the many applications of EDMs, such as molecular conformation in bioinformatics, dimensionality reduction in machine learning and statistics, and especially the problem of wireless sensor network localization, have all become very active areas of res...

متن کامل

Euclidean and circum-Euclidean distance matrices: Characterizations and linear preservers

Short proofs are given to various characterizations of the (circum-)Euclidean squared distance matrices. Linear preserver problems related to these matrices are discussed.

متن کامل

Recovering Euclidean Distance Matrices via Landmark MDS

In network topology discovery, it is often necessary to collect measurements between network elements without injecting large amounts of traffic into the network. A possible solution to this problem is to actively query the network for some measurements and use these to infer the remaining ones. We frame this as a particular version of the Noisy Matrix Completion problem where the entries refle...

متن کامل

Ela on Euclidean Distance Matrices of Graphs

Received by the editors on November 13, 2011. Accepted for publication on July 8, 2013. Handling Editor: Bryan L. Shader. FMF and IMFM, University of Ljubljana, Jadranska 19, 1000 Ljubljana, Slovenia, and IAM, University of Primorska, Slovenia ([email protected]). XLAB d.o.o., Pot za Brdom 100, 1125 Ljubljana, Slovenia, and FMF, University of Ljubljana, Slovenia ([email protected]...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear & Multilinear Algebra

سال: 2021

ISSN: ['0308-1087', '1026-7573', '1563-5139']

DOI: https://doi.org/10.1080/03081087.2021.1972083